ZZZ (working) / Graph, Edge cover (Bibtex)

P238: Enumeration of all minimal edge-covers of an intersecting $st$-family
Input:
A graph $G$.
Output:
All minimal edge-covers of an intersecting $st$-family.
Complexity:
Polynomial delay.
Comment:
This complexity also holds for directed graphs.
Reference:
[Nutov2009] (Bibtex)